An Axiomatization of Well Branching Prime Event Structures an Axiomatization of Well Branching Prime Event Structures

We develop a tense logic for reasoning about the occurrences of events in a sub-class of prime event structures called well branching event structures. The well branching property ensures that two events being in connict can always be traced back | via the causality relation | to two events being in minimal connict. Two events are in minimal connict if they are in connict and their \uniied" past is connict-free. Thus the minimal connict relation captures the branching points of the computations supported by the event structure. Our logical language has explicit modalities for talking about causality, connict, concurrency and minimal connict. We deene the semantics of this logic using well branching event structures as Kripke frames. Our main result is a sound and complete axiomatization of the valid formulas over the chosen class of frames.